Computational power of Hamiltonians in quantum computing
نویسنده
چکیده
error group, 54Addelman and Kempthorne, 60adiabatic, 171adiabatic quantum computing, 171adjacency matrix, 94adjoint action, 76, 90amplification, 149annihilation operator, 134annihilator, 49, 50minimal, 50Arthur-Merlin games, 147average Hamiltonian, 44average Hamiltonian theory, 44 Bloch sphere, 33Bloch vector, 33BPP, 31BQP, 30 Carathéodory’s theorem, 99character, 78chromatic index, 128weighted, 129chromatic number, 73, 99lower bound, 102clique, 116clique coloring index, 100, 116lower bound, 104weighted, 117clique decoupling, 116clique partition, 116control group, 41, 43control Hamiltonian, 40control sequence, 48concatenation, 48control-theoretic model, 37complexity, 40, 43coupling matrix, 90creation operator, 134cubic, 145cut, 144 decoupling, 49, 56, 107, 135clique, 116equivalence of schemes, 64scheme, 56selective, 97with difference schemes, 62with generalized Hadamard ma-trices, 135with Hadamard matrices, 63with orthogonal arrays, 59density operator, 31diagonal coupling, 61difference scheme, 61, 62dipolar coupling, 61drift Hamiltonian, 40 energy, 39energy eigenstate, 39entanglement, 22entropy, 51equivalence check, 156definition, 157error basis, 50nice, 53
منابع مشابه
Efficient solvability of Hamiltonians and limits on the power of some quantum computational models.
One way to specify a model of quantum computing is to give a set of control Hamiltonians acting on a quantum state space whose initial state and final measurement are specified in terms of the Hamiltonians. We formalize such models and show that they can be simulated classically in a time polynomial in the dimension of the Lie algebra generated by the Hamiltonians and logarithmic in the dimensi...
متن کاملQuantum speedup in stoquastic adiabatic quantum computation
Quantum computation provides exponential speedup for solving certain mathematical problems against classical computers. Motivated by current rapid experimental progress on quantum computing devices, various models of quantum computation have been investigated to show quantum computational supremacy. At a commercial side, quantum annealing machine realizes the quantum Ising model with a transver...
متن کاملOn complexity of the quantum Ising model
We study the computational complexity of estimating the ground state energy and simulating the adiabatic evolution for the transverse field Ising model (TIM). It is shown that the ground state energy problem for TIM on a degree-3 graph is complete for the complexity class StoqMA. This is an extension of the classical class MA where the verifier can accept quantum states as a proof and apply cla...
متن کاملComputational Difficulty of Computing the Density of States
We study the computational difficulty of computing the ground state degeneracy and the density of states for local Hamiltonians. We show that the difficulty of both problems is exactly captured by a class which we call #BQP, which is the counting version of the quantum complexity class quantum Merlin Arthur. We show that #BQP is not harder than its classical counting counterpart #P, which in tu...
متن کاملThe 2D AKLT state is a universal quantum computational resource
Quantum computation promises exponential speedup over classical computation by exploiting the quantum mechanical nature of physical processes [1]. In addition to the standard circuit models, surprisingly, local measurement alone provides the same power of computation, given only a prior sufficiently entangled state [2]. Cluster states are the first known resource states for such measurement-bas...
متن کاملThe Complexity of Computing the Density of States
We study the computational difficulty of computing the ground state degeneracy and the density of states for local Hamiltonians. We show that the difficulty of both problems is exactly captured by a class which we call #BQP, which is the counting version of the quantum complexity class QMA. We show that #BQP is not harder than its classical counting counterpart #P, which in turn implies that co...
متن کامل